An element-by-element preconditioned conjugate gradient method implemented on a vector computer
نویسندگان
چکیده
We consider the linear equation Ax = b where A is a sparse symmetric positive definite matrix arising from a finite element discretisation. We use the preconditioned conjugate gradient method to solve this equation, introducing an element-by-element preconditioner which is based on a Crout's decomposition of the element matrices and an element-by-element product of them. When the mesh is coloured, this preconditioner is largely vectorizable. We implement this method on a CRAY-2, and test it on 2D and 3D elastic and thermal problems and compare it to other classical preconditioners.
منابع مشابه
An K - Step Preconditioned Conjugate Gradient Hethod
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
متن کاملContractor Report 172150 leASE NASA - CR - 172150 19830020669
Tbis paper describes a preconditioned conjugate gradient method tbat can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systema of linear equations. The implementation on the CYBER 203/205 and on tbe Finite Element Machine is discuased and result a obtained using the method on these machines are siven.
متن کاملAdaptive Multilevel Finite Elements for Mesh Optimization and Visualization
Multilevel representations and mesh reduction techniques have been used for accelerating the processing and the rendering of large datasets representing scalar or vector valued functions defined on complex 2 or 3 dimensional meshes. We present a method based on finite elements and hierarchical bases which combines these two approaches in a new and unique way that is conceptually simple and theo...
متن کاملDomain decomposition and parallel processing of a finite element model of the shallow water equations
We present nonoverlapping domain decomposition techniques applied to a two-stage NumerovGalerkin finite element model of the shallow water equations over a limited-area domain. The Schur complement matrix formulation is employed and a modified interface matrix approach is proposed to handle the coupling between subdomains. The resulting nonsymmetric Schur complement matrices, modified interface...
متن کاملDeflation accelerated parallel preconditioned Conjugate Gradient method in Finite Element problems
We describe the algorithm to implement a deflation acceleration in a preconditioned Conjugate Gradient method to solve the system of linear equations from a Finite Element discretization. We focus on a parallel implementation in this paper. Subsequently we describe the data-structure. This is followed by some numerical experiments. The experiments indicate that our method is scalable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 1991